Input-Feedforward-Passivity-Based Distributed Optimization Over Jointly Connected Balanced Digraphs
نویسندگان
چکیده
In this article, a distributed optimization problem is investigated via input feedforward passivity. First, an input-feedforward-passivity-based continuous-time algorithm proposed. It shown that the error system of proposed can be decomposed into group individual passive (IFP) systems interact with each other using output feedback information. Based on IFP framework, convergence conditions suitable coupling gain are derived over weight-balanced and uniformly jointly strongly connected topologies. also IFP-based converges exponentially when topology connected. Second, novel derivative based passivation systems. While most works directed topologies require knowledge eigenvalues graph Laplacian, fully distributed, namely, it robust against randomly changing digraphs any positive without knowing global Finally, numerical examples presented to illustrate algorithms.
منابع مشابه
Distributed Random-Fixed Projected Algorithm for Constrained Optimization Over Digraphs
This paper is concerned with a constrained optimization problem over a directed graph (digraph) of nodes, in which the cost function is a sum of local objectives, and each node only knows its local objective and constraints. To collaboratively solve the optimization, most of the existing works require the interaction graph to be balanced or “doubly-stochastic”, which is quite restrictive and no...
متن کاملDistributed strategies for generating weight-balanced and doubly stochastic digraphs
This paper deals with the design and analysis of dynamical systems on directed graphs (digraphs) that achieve weight-balanced and doubly stochastic assignments. Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of coordination problems, including formation control, agreement, and distributed optimization. We refer to a digraph as...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملConditions on input disturbance suppression for multivariable nonlinear systems on the basis of feedforward passivity
In this paper, we consider the problem of input disturbance suppression for nonlinear systems based on feedforward passivity. Firstly, we show that integral control can sufficiently suppress a class of slowly variant (including constant) input disturbance and track constant references provided certain closed-loop stability is achieved. Then, sufficient conditions of integral controllability for...
متن کاملOutput feedback quantized observer-based synchronization of linear multi-agent systems over jointly connected topologies
The synchronization problem of linear over-actuated multi-agent systems with unmeasurable states is studied in this paper, under both limited communication data rate and switching topology flows. A class of adaptive quantized observer-based encoding–decoding schemes and a class of certainty equivalence principle-based control protocols are proposed. By developing the graph-based space decomposi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2021
ISSN: ['0018-9286', '1558-2523', '2334-3303']
DOI: https://doi.org/10.1109/tac.2020.3028838